Approximate multi-visibility map computation

نویسندگان

  • Narcís Coll
  • Marta Fort
  • Joan Antoni Sellarès
چکیده

A multi-visibility map is the subdivision of the domain of a terrain into different regions that, according to different criteria, encode the visibility with respect to a set of view elements. We present an algorithm for computing approximate multi-visibility maps for a terrain, modeled as a TIN, with respect to a set of view segments. Our approach is based on an algorithm that reconstructs an approximation of an unknown planar subdivision from information gathered from linear probes of the subdivision.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-visibility in Terrains

A multi-visibility map is the subdivision of the domain of a terrain into different regions that, according to different criteria, encode the visibility with respect to a set of view elements. We present an algorithm for computing approximate multi-visibility maps for a terrain, modeled as a TIN, with respect to a set of view segments. Our approach is based on an algorithm that reconstructs an ...

متن کامل

Imperfect Ray-Bundle Tracing for Interactive Multi-Bounce Global Illumination

Introduction A bidirectional sampling method with raybundles [TO12] enables high-quality global illumination, but computation time of ray-bundles depends on the number of sample directions and the number of primitives. This poster proposes an approximate ray-bundle tracing based on imperfect shadow maps (ISMs) [RGK∗08]. ISMs accelerate light path visibility tests using a point-based rendering. ...

متن کامل

Hierarchical Techniques for Visibility Computations

Visibility computation is crucial for computer graphics from its very beginning. The first visibility algorithms aimed to determine visible lines or surfaces in a synthesized image of a 3D scene. Nowadays there is a plethora of visibility algorithms for various applications. The thesis proposes a taxonomy of visibility problems based on the dimension of the problem-relevant line set, i.e. set o...

متن کامل

Fast Approximate Visibility on the GPU using pre- computed 4D Visibility Fields

We present a novel GPU-based method for accelerating the visibility function computation of the lighting equation in dynamic scenes composed of rigid objects. The method pre-computes, for each object in the scene, the visibility and normal information, as seen from the environment, onto the bounding sphere surrounding the object and encodes it into maps. The visibility function is encoded by a ...

متن کامل

Fast, Realistic Lighting and Material Design using Nonlinear Cut Approximation

We present an interactive rendering system for realistic lighting and material design under complex illumination with arbitrary BRDFs. Our system smoothly integrates accurate all-frequency relighting of shadows and reflections with dynamic per-pixel shading effects such as bump mapping and spatially varying BRDFs. This combination of capabilities is typically missing in current systems. We buil...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005